Space-eecient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting
نویسندگان
چکیده
We present linear space sublogarithmic algorithms for handling the three dimensional dominance reporting problem and the two dimensional range counting problem Under the RAM model as described in M L Fredman and D E Willard Surpassing the information theoretic bound with fusion trees Journal of Computer and System Sciences our algorithms achieve O logn log logn f query time for D dominance reporting where f is the number of points reported and O logn log logn query time for D range counting case We extend these results to any constant dimension d achieving O n logn log logn d space and O logn log log d f query time for the reporting case and O n logn log logn d space and O logn log logn d query time for the counting case
منابع مشابه
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. “Surpassing the information theoretic bound with fusion trees”, Journal of Computer and System Sciences, 47:424– 436, 1993], our algorithms achieve O(log n/ log log n + f) qu...
متن کاملFast Algorithms for D Dominance Reporting and Counting
We present in this paper fast algorithms for the D dominance reporting and counting problems and generalize the results to the d dimensional case Our D dominance reporting algorithm achieves O log n log log n f query time using O n log n space where f is the number of points satisfying the query and is an arbitrarily small constant For the D dominance counting problem which is equivalent to the...
متن کاملFast Algorithms For 3-D Dominance Reporting And Counting
We present in this paper fast algorithms for the 3-D dominance reporting and counting problems, and generalize the results to the d-dimensional case. Our 3-D dominance reporting algorithm achieves O(log n= log log n + f) 1 query time using O(n log n) space , where f is the number of points satisfying the query and > 0 is an arbitrarily small constant. For the 3-D dominance counting problem (whi...
متن کاملGeometric Algorithms for Private-Cache Chip Multiprocessors
We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2-D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort ...
متن کاملPcube: Update-eecient Online Aggregation with Progressive Feedback and Error Bounds
Data Cubes are used in large data warehouses as a tool for online aggregation of information. Typically , online aggregation is supported by specifying a range query over a multidimensional data cube. As the number of dimensions increases, supporting eecient range queries as well as updates to the data cube becomes diicult. Another problem that arises with increased dimensionality is the sparse...
متن کامل